Method and/or system for tree transformation

ABSTRACT

Embodiments of methods, apparatuses, devices and/or systems for transforming complex two dimensional graphical hierarchies are disclosed.

This application claims the benefit of U.S. Provisional Patent Application Ser. No. 60/648,950, filed on Jan. 31, 2005, and assigned to the assignee of claimed subject matter.

BACKGROUND

This disclosure is related to hierarchical data arrangements and, more particularly, to manipulating such data arrangements.

In a variety of fields, data or a set of data, may be represented in a hierarchical fashion. This form of representation may, for example, convey information, such as particular relationships between particular pieces of data and the like. However, manipulating such data representations is not straight-forward, particularly where the data is arranged in a complex hierarchy. Without loss of generality, one example may include a relational database. Techniques for performing operations on such a database, for example, are computationally complex or otherwise cumbersome. A continuing need, therefore, exists for additional techniques for manipulating data hierarchies.

BRIEF DESCRIPTION OF THE DRAWINGS

Subject matter is particularly pointed out and distinctly claimed in the concluding portion of the specification. The claimed subject matter, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference of the following detailed description when read with the accompanying drawings in which:

FIG. 1 is a schematic diagram of one embodiment of a tree;

FIG. 2 is a schematic diagram illustrating one embodiment of a binary edge labeled tree (BELT);

FIG. 3 is a schematic diagram illustrating another embodiment of a BELT;

FIG. 4 is a schematic diagram illustrating an embodiment of a binary edge labeled string;

FIG. 5 is a schematic diagram of an embodiment of a node labeled tree;

FIGS. 6-10 are schematic diagrams illustrating a process to transform a node labeled tree to a BELT according to an embodiment;

FIGS. 11-16 are schematic diagrams illustrating a process to transform a node labeled tree comprising one or more null node label values to a BELT according to an embodiment;

FIGS. 17-22 are schematic diagrams of trees illustrating a transformation of an unlabeled tree to a BELT according to an embodiment;

FIG. 23 is a schematic diagram associating particular node label values with portions of BELTs according to an embodiment of the BELT shown in FIG. 22;

FIG. 24 is a flow diagram illustrating a process of associating node label values with BELTs and/or portions of BELTs according to an embodiment;

FIG. 25 is a table illustrating a particular embodiment of an association between numerals and BELTs and/or portions of BELTs;

FIG. 26 illustrates a representation of node label values as a portion of a BELT according to an embodiment;

FIG. 27 is a table illustrating a particular embodiment of an association between natural numerals and BELTs; and

FIG. 28 is a table illustrating a portion of the Kleene enumeration of non-composite numerals.

DETAILED DESCRIPTION

In the following detailed description, numerous specific details are set forth to provide a thorough understanding of the claimed subject matter. However, it will be understood by those skilled in the art that the claimed subject matter may be practiced without these specific details. In other instances, well-known methods, procedures, components and/or circuits have not been described in detail so as not to obscure the claimed subject matter.

Some portions of the detailed description which follow are presented in terms of algorithms and/or symbolic representations of operations on data bits or binary digital signals stored within a computing system memory, such as a computer memory. These algorithmic descriptions and/or representations are the techniques used by those of ordinary skill in the data processing arts to convey the substance of their work to others skilled in the art. An algorithm is here, and generally, considered to be a self-consistent sequence of operations and/or similar processing leading to a desired result. The operations and/or processing involve physical manipulations of physical quantities. Typically, although not necessarily, these quantities may take the form of electrical and/or magnetic signals capable of being stored, transferred, combined, compared and/or otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, data, values, elements, symbols, characters, terms, numbers, numerals and/or the like. It should be understood, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels. Unless specifically stated otherwise, as apparent from the following discussion, it is appreciated that throughout this specification discussions utilizing terms such as “processing”, “computing”, “calculating”, “determining” and/or the like refer to the actions and/or processes of a computing platform, such as a computer or a similar electronic computing device, that manipulates and/or transforms data represented as physical electronic and/or magnetic quantities within the computing platform's memories, registers, and/or other information storage, transmission, and/or display devices.

In a variety of fields, data or sets of data may be represented in a hierarchical fashion. This form of representation may, for example, convey information, such as particular relationships between particular pieces of data and the like. However, manipulating such data representations is not straight forward, particularly where the data is arranged in a complex hierarchy. Without loss of generality, one example may include a relational data base. Techniques for performing operations on such a data base for example, may be computationally complex or otherwise cumbersome. A continuing need, therefore, exists for additional techniques for manipulating data hierarchies.

As previously discussed, in a variety of fields, it is convenient or desirable to represent data, a set of data and/or other information in a hierarchical fashion. In this context, such a hierarchy of data shall be referred to as a “tree.” In a particular embodiment, a tree may comprise a finite, rooted, connected, unordered, acyclic graph. This is illustrated here, for example, in FIG. 1 by embodiment 100. As illustrated, the root of this particular embodiment encompasses node 105. In addition to 105, there are eight other nodes designated 110 to 140, respectively. Likewise, the nodes are connected by branches referred to, in this context, as edges. Thus, the nodes of this tree are connected by eight edges. This embodiment, therefore, illustrates a finite tree that is rooted by node 105. Furthermore, the nodes are connected, meaning, in this context, that a path exists between any two nodes of the tree. The tree is likewise acyclic, meaning here, that no path in the tree forms a complete non-backtracking loop. Here, unordered refers to the notion that there is no implied ordering or precedence among nodes attached to a common node, despite the appearance of ordering in a graphical illustration.

As previously suggested, in a variety of contexts, it may be convenient and/or desirable to represent a hierarchy of data and/or other information using a structure, such as the embodiment illustrated in FIG. 1. One particular embodiment, without loss of generality, of a tree may include edges that are labeled with data and/or other values. Likewise, in one particular embodiment, such data or values may be limited to binary data, that is, in this example, either a binary one or a binary zero. Here, such an embodiment may be referred to as a binary edge labeled tree (BELT), as shall be discussed in more detail hereinafter.

One example of a BELT is illustrated by embodiment 200 of FIG. 2. Thus, as illustrated, the edges of the BELT shown in FIG. 2 are labeled with either a binary zero or binary one. FIG. 3 illustrates another embodiment 300 of a different binary edge labeled tree. It is noted that this tree is similar or isomorphic to the embodiment of FIG. 2.

A subset of BELTs may be referred to in this context as binary edge labeled strings (BELSs). One embodiment, 400, is illustrated in FIG. 4. Thus, as illustrated by embodiment 400, this particular binary edge labeled string comprises four nodes and three edges, where the edges are labeled, respectively, binary zero, binary one and binary zero. Thus, a binary edge labeled string comprises a binary edge labeled tree in which each node has no more than two edges. To reiterate, in this context, a string comprises a binary edge labeled string and a tree comprises a binary edge labeled tree if each edge of the string or tree respectively stores a single bit. Likewise, in this context, two nodes are employed to support an edge holding, storing and/or representing a single piece of binary data. At this point, it is worth noting that strings and trees having nodes and edges, such as previously described, may be represented in a computing platform or similar computing device through a data structure or a similar mechanism intended to capture the hierarchical relationship of the data. It is intended that all such embodiments are included within the scope of the claimed subject matter.

In addition to, or as an alternative to storing, holding and/or representing information in edges of a tree in an edge labeled tree, a tree may similarly store, hold and/or represent information in nodes of a tree. Here, such a tree storing, holding and/or representing information in node of a tree may comprise a “node labeled tree” in which information may be stored, held and/or represented in node label values associated with particular nodes. Additionally, a tree storing, holding and/or representing information in nodes and edges may comprise a “feature tree” in which information may be stored, held and/or represented in node label values and/or edge label values. Accordingly, edge labeled trees and node labeled trees comprise particular types of trees in a greater class of trees known as feature trees.

While node and edge labeled trees may be used to express hierarchical data, a tree may not necessarily store, hold and/or represent information in any of its nodes or edges. For example, an “unlabeled tree” may represent hierarchical data without having any information stored, held or represented in any of its edges or nodes (including root nodes and/or terminal nodes). Rather, such hierarchical data may be expressed in how nodes and/or edges in an unlabeled tree may relate to other nodes and/or edges.

According to an embodiment, a “set” may define a collection of unique unordered elements or members. For example, for the purpose of illustration, a set may contain members or elements of a distinct classification, such as the set of all automobiles in a parking lot of a particular color. In a particular embodiment, trees may be classified into sets defined by certain characteristics, such as the set containing node labeled trees, BELTs, unlabeled trees, and the like. However, this is merely an example of how trees may be classified into distinct sets and the claimed subject matter is not limited in this respect.

According to an embodiment, a “transformation” may define a process by which elements of a first set may be mapped into and/or associated with elements of a second set. For example, in a particular embodiment, a transformation may map and/or associate a member of the set of unlabeled trees with a member of the set of node labeled trees. Similarly, according to a particular embodiment, a transformation may map and/or associate a member of the set of node labeled trees with a member of the set of BELTs. Likewise, a transformation may map and/or associate a member of the set of unlabeled trees with a member of the set of BELTs. However, these are merely examples of how a transformation may map and/or associate members of one set to members of another set, and the claimed subject matter is not limited in these respects.

According to an embodiment, a transformation may associate and/or map an element in a first set with an element in a second set as an “elementary equivalent.” Here, in a particular embodiment, such a transformation may associate such elementary equivalent elements in different sets in a one-to-one and onto mapping in which the transformation defines for elements in a first set corresponding, unique elementary equivalents in a second set. Similarly, a transformation may also map and/or associate members of the second set to corresponding elementary equivalents in the first set.

Examples of a transformations mapping and/or associating elementary equivalent elements of different sets may be found in, for example, Logical Number Theory, An Introduction, by Craig Smorynski, p. 305. In a particular embodiment, for example, a transformation may map and/or associate trees of a first type (e.g., a member of the set of unlabeled trees, node labeled trees or BELTs) to elementary equivalent trees of a second type. However, this is merely an example of how a transformation may map and/or associate members of different sets as elementary equivalents, and the claimed subject matter is not limited in these respects.

Also, operations and/or manipulations of elements in a first set may provide elements that are also in the first set. For example, for the purpose of illustration, the addition of positive integers (the first set) to positive integers results in positive integers. According to an embodiment, operations and/or manipulations on a tree of a particular type (e.g., unlabeled tree, node labeled tree or BELT) may result in another tree of the same type, for example.

A transformation of elements in a first set to elementary equivalents in a second set may also map and/or associate results from an operation and/or manipulation of the elements of the first set to elementary equivalents of the results in the second set, For the operation and/or manipulation of the elements in the first set, a corresponding operation and/or manipulation may exist for elements in a second set which are elementary equivalents of the elements of the first set. Here, the corresponding operation and/or manipulation of elements in the second set may provide elementary equivalents of the results of the operation and/or manipulation of the elements in the first set. Continuing with the example of the addition of positive integers, for the purpose of illustration, the set of negative integers may comprise a set of elements that are elementary equivalents of positive integers mapped and/or associated by a transformation comprising multiplication by negative one. Here, addition of negative integers provides a negative integer which may comprise an elementary equivalent of a sum resulting from the addition of positive integers (which themselves comprise elementary equivalents of the added negative integers).

According to an embodiment, an operation and/or manipulation of a first tree of a particular first type (representing hierarchical data) may result in a second tree of the first type. Here, a transformation associating and/or mapping the first tree of the first type to an elementary equivalent first tree of a second type may also map the second tree of the first type to an elementary equivalent second tree of the second type. Here, a corresponding operation and/or manipulation on the first tree of the second type may provide the second tree of the second type. However, these are merely examples of how a transformation may associate and/or map elements of a first set with elements of a second set as elementary equivalents, and the claimed subject matter is not limited in these respects.

Binary edge labeled trees and binary node labeled trees may be employed nearly interchangeably to represent substantially the same hierarchy of data. In particular, a binary node labeled tree may be associated with a binary edge labeled tree in which the nodes of the binary node labeled tree take the same values as the edges of the binary edge labeled tree, except that the root node of the binary node labeled tree may comprise a node having a zero value or a null value. Thus, rather than employing binary edge labeled trees to express hierarchical data, the hierarchical data may alternatively be expressed in corresponding binary node labeled trees.

As discussed above, operations and/or manipulations of trees may correspond with operations and/or manipulations of the hierarchical data represented in such trees. Similarly, operations and/or manipulations of trees of a particular type (e.g., unlabeled trees) may correspond with operations and/or manipulations of elementary equivalent trees of a different type (e.g., node labeled trees and/or BELTs). Here, a transformation may associate and/or map trees of the first type to trees of the second type as elementary equivalents.

Operations on trees may, in some situations, be efficient for processing hierarchical data in the form of a BELT. According to an embodiment, it may be desirable to transform an unlabeled tree to a node labeled tree and/or BELT. Here, the BELT resulting from the transformation may comprise an elementary equivalent of the original unlabeled tree by expressing essentially the same hierarchical data as the unlabeled tree. Accordingly, operations on the hierarchical data expressed in the unlabeled tree may be carried out on the resulting BELT. For example, expressing hierarchical data of an unlabeled tree in a BELT may enable greater efficiency in indexing the hierarchical data for processing. Also, expression of hierarchical data of an unlabeled tree in the form of a BELT may enable an expression of the hierarchical data as a binary string that may use less memory for storage of the hierarchical data, for example. However, these are merely examples of potential or possible advantages to transforming an unlabeled tree to a BELT and the claimed subject matter is not limited in these respects.

In accordance with the claimed subject matter, therefore, any tree, regardless of whether it is binary edge labeled, binary node labeled, non-binary, a feature tree, or otherwise, may be manipulated and/or operated upon. For example, and as shall be described in more detail below, a node labeled tree in which the nodes are labeled with natural numerals or data values may be transformed to a binary edge labeled tree. Furthermore, this may be accomplished with approximately the same amount of storage. For example, for this particular embodiment, this may involve substantially the same amount of node and/or edge data label values.

As previously noted, the claimed subject matter is not limited in scope to this particular example, however, as illustrated in more detail hereinafter, the tree illustrated in FIG. 5 may be transformed to a binary edge labeled tree through a sequence of processing depicted here as graph operations, although such a transformation may alternatively be implemented by operations implemented otherwise, one such example being by a computing platform, for example. Alternatively, it may be desirable, depending upon the particular embodiment, to transform trees to, for example, binary node labeled trees. Likewise, other embodiments in which trees of one form are transformed to trees of another form are also included within the scope of the claimed subject. In this example, a particular tree, embodiment 1100, is illustrated in FIG. 5, comprises a node labeled tree rather than an edge labeled tree.

According to an embodiment, trees or portions of trees may be represented by natural numerals according to an association of trees and natural numerals. Without belaboring the present discussion, additional descriptions of how natural numerals may be associated with trees is discussed in greater detail below and in U.S. patent application Ser. No. 11/005,859, filed on Dec. 6, 2004, by J. J. LeTourneau, titled, “Manipulating Sets of Hierarchical Data,” assigned to the assignee of the presently claimed subject matter. It should be understood, however, that while the particular embodiments illustrated are directed to particular associations of numerals and trees, there may be many associations of trees to numerals according to corresponding particular “association embodiments,” and the claimed subject matter is not limited to any such particular association.

According to an embodiment, a transformation of node labeled tree 1100 to a BELT makes use of an association of BELTs and/or portions of BELTs with numerals according to a particular association embodiment. As illustrated below, according to a particular embodiment, node label values of node labeled tree 1100 may express essentially the same information of BELTs or portions of a BELT. Accordingly, such a transformation may comprise, at least in part, replacing at least some of the node label values with corresponding BELTs or portions of BELTs.

Referring now to FIG. 5, node values are deleted for those nodes storing the value zero. This is illustrated, for example, in FIG. 6. Node values are also deleted for the nodes storing the value one. In this case, a new single unlabeled node is attached to those nodes that had stored the value one, and the edge between the prior node and the new node is labeled with a zero value. This is illustrated, for example, in FIG. 7. For nodes with a label value k that is a power of 2, and larger than one, the node label value is deleted and (log₂(k)+1) new nodes are attached, labeling the edge between the new nodes and the old nodes with a zero value. This, for example, is illustrated in FIG. 8.

The remaining node label values comprise non-powers of two that are three or larger. These node label values are factored into one or more non-composite numerals. For such a resulting non-composite numeral factor of a node's label value, a tag representing the non-composite numeral factor may be connected to the node by an edge having an edge label value of binary zero. The tag may comprise a portion of a BELT representing the non-composite numeral factor according to an association of BELTs and numerals of a particular association embodiment. Such an association of BELTs and numerals is illustrated in detail below. However, it should be understood that this is merely an example of an association of numerals and BELTs and that the claimed subject matter is not limited in these respects. This is illustrated, for example, in FIG. 9. The remaining edges of the tree are labeled with a binary value of one. This is illustrated in FIG. 10.

In another embodiment, however, a particular tree may include null types or, more particularly, some node values denoted by the empty set. This is illustrated, for example, by the tree in FIG. 11, although, of course, this is simply one example. An advantage of employing null types includes the ability to address a broader array of hierarchical data sets. For example, without loss of generality and not intending to limit the scope of the claimed subject matter in any way, a null type permits representing in a relational database, as one example, situations in which a particular attribute does not exist. As may be appreciated, this is different from a situation, for example, where a particular attribute may take on a numeral value of zero. Thus, it may be desirable to be able to address both situations when representing, operating upon and/or manipulating hierarchical sets of data.

A particular application of null node label values may be applied to a transformation of BELTS to binary node labeled trees (BNLTs). While FIGS. 2 through 4 illustrate specific examples of BELTs, it should be understood that the information expressed in a BELT may comprise essentially the same information represented in a BNLT having the same structure of corresponding nodes and edges. Here, a transformation from a BELT to a BNLT may comprise assigning node label values to nodes in the resulting BNLT the edge label values of edges in the BELT connecting corresponding nodes to their parents. The root node in the resulting BNLT may then be assigned a null label value. Similarly, a BNLT may be transformed to a BELT by assigning label values of nodes to edges connecting the nodes to corresponding parent nodes. As such, BELTs and BNLTs may comprise members of class of trees called binary labeled trees (BLTs) in which either nodes or edges hold, store and/or represent a binary label value.

For this particular embodiment, a tree with nulls, as described above, may be transformed to a tree without nulls. This shall be illustrated, for example, for nodes labeled with a null, such as for the tree in FIG. 11; however, the claimed subject matter is not limited in scope in this respect, of course. In this particular embodiment, the nulls are deleted from those nodes having a null. This is illustrated, for example, by FIG. 12.

Referring now to FIG. 13, node values are also deleted for those nodes storing the value zero. Furthermore, a single new node is attached to the nodes previously storing the zero values. The edge between the prior nodes and the new nodes are labeled with a zero value. For nodes with a value k that is a power of two, including the value one, the node value is deleted and (log₂(k)+2) new nodes are attached, labeling the edge between the new nodes and the old nodes with a zero value. This is illustrated, for example, in FIG. 14.

The remaining node label values comprise non-powers of two that are three or larger. These node label values are factored into one or more non-composite numerals. For such a resulting non-composite numeral factor of a node's label value, a tag representing the non-composite numeral factor may be connected to the node by an edge having an edge label value of binary zero. The tag may comprise a portion of a BELT representing the non-composite numeral factor according to an association of BELTs and numerals of a particular association embodiment. Such an association of BELTs and numerals is illustrated in detail below. However, it should be understood that this is merely an example of an association of numerals and BELTs and that the claimed subject matter is not limited in these respects. This is illustrated, for example, in FIG. 15. The remaining edges are labeled with a binary value of one. This tree is illustrated, for example, in FIG. 16.

In an alternative embodiment, a node labeled tree may comprise fixed length tuples of numerals. For such an embodiment, such multiple numerals may be combined into a single numeral, such as by employing Cantor pairing operations, for example. See, for example, Logical Number Theory, An Introduction, by Craig Smorynski, pp, 14-23, available from Springer-Verlag, 1991. This approach should produce a tree to which the previously described embodiments may then be applied. Furthermore, for one embodiment, a tree in which nodes are labeled with numerals or numerical data, rather than binary data, may be transformed to a binary edge labeled tree and/or binary node labeled tree, and, for another embodiment, a tree in which edges are labeled with numerals or numerical data, rather than binary data, may be transformed to a binary edge labeled tree and/or binary node labeled tree.

FIGS. 17 through 22 are schematic diagrams of trees illustrating a transformation of an unlabeled tree to a BELT according to an embodiment. This is illustrated as a sequence of operations depicted here as graph operations, although such a transformation may alternatively be implemented by operations implemented otherwise, one such example being by a computing platform, for example. Likewise, other embodiments in which trees of one form are transformed to trees of another form are also included within the scope of the claimed subject matter.

FIG. 17 is a schematic diagram of an unlabeled tree 2300 comprising a root node 2302 according to an embodiment. Identifying root node 2302 indicates a directional flow of hierarchical data represented in unlabeled tree 2300 descending away from root node. In addition to having a root node to indicate the directional flow of the hierarchical data, one or more nodes in the tree may be identified as “terminal nodes” having no children or offspring nodes. Hence, identification of the terminal nodes in a tree indicates a directional flow of hierarchical data ascending away from the terminal nodes toward a root node.

FIG. 18 is a schematic diagram of unlabeled tree 2300 showing terminal nodes as cross-hatched nodes. As illustrated from FIG. 18, a tree may comprise a single root node but multiple terminal nodes. According to an embodiment, a tree may comprise one or more nodes which are “frontier nodes.” A frontier node is connected to one or more child nodes and does not have any grandchild nodes. In other words, a frontier node has at least one child node and all nodes descending from a frontier node are terminal nodes. As illustrated in FIG. 19, by way of example, according to a particular embodiment, frontier nodes 2304 in tree 2300 are connected to one or more corresponding child terminal nodes. Also, at least some of the terminal nodes are not directly connected to a frontier node.

FIGS. 20 through 22 are schematic diagrams illustrating a process to transform unlabeled tree 2300 to a BELT that comprises an elementary equivalent of unlabeled tree 2300. In this particular embodiment, unlabeled tree 2300 may represent hierarchical data and the transformation illustrated below may map unlabeled tree 2300 to a BELT that represents essentially the same hierarchical data. According to an embodiment, tree 2300 is transformed to a node labeled tree 2500 shown in FIG. 21 which comprises an elementary equivalent of tree 2300. Then, as illustrated above, node labeled tree 2500 may be transformed to a BELT 2600 shown in FIG. 22 which comprises an elementary equivalent of tree 2600. Accordingly, in a particular embodiment, the resulting tree 2600 comprises an elementary equivalent of tree 2300. However, this is merely an example of how an unlabeled tree may be transformed to a BELT that is an elementary equivalent of the unlabeled tree and the claimed subject matter is not limited in this respect.

According to an embodiment, FIG. 20 illustrates a process of “pruning” terminal nodes in tree 2300 from frontier nodes. Here, tree 2400 shows darkened nodes 2404 which correspond with frontier nodes 2304 of tree 2300. According to an embodiment, tree 2400 may be generated by pruning and/or removing one terminal node connected to each of the corresponding frontier nodes 2304. The remaining terminal nodes of tree 2300 (i.e., the unpruned terminal nodes) are indicated with cross-hatching. However, this is merely an example of how terminal nodes may be pruned from corresponding frontier nodes and the claimed subject matter is not limited in this respect.

FIG. 21 is a schematic diagram of a node labeled tree 2500 which may be determined, at least in part, from tree 2400. According to an embodiment, the remaining terminal nodes of tree 2300 indicated with cross-hatching in tree 2400 are replaced with node label values associated with parent nodes in tree 2500. In a particular embodiment, for example, nodes in tree 2400 having a natural numeral k of such remaining terminal nodes as children are associated with nodes in tree 2500 having a node label value of k and the remaining terminal node children in tree 2400 are removed in the resulting tree 2500. Again, tree 2500 may represent essentially the same hierarchical data represented in tree 2400. Here, the resulting node labeled tree 2500 determined from the above described transformation may comprise an elementary equivalent of unlabeled tree 2300. However, this is merely an example how an unlabeled tree may be transformed to an elementary equivalent node labeled tree and the claimed subject matter is not limited in this respect.

Nodes in tree 2500 contain a numeral as a node label value to represent a count of remaining terminal nodes removed from corresponding nodes in tree 2400. While not shown in FIG. 21, the remaining nodes in tree 2500 not showing a node label may nevertheless be assigned a node label value of natural numeral “0.” According to an embodiment, tree 2500 may be transformed to an elementary equivalent BELT by replacing nodes in tree 2500 having a non-zero node label value with an equivalent portion of a BELT. In a particular embodiment, the portion of a BELT equivalent to the non-zero node label value may be determined according to an association embodiment of numerals and trees.

FIG. 22 is a schematic diagram of a BELT 2600 resulting from a transformation from node labeled tree 2500 according to an embodiment. According to a particular embodiment, edges in BELT 2600 corresponding with edges existing in node labeled tree 2500 may be labeled with a numeral “1.” Then, nodes in BELT 2600 corresponding to nodes in node labeled tree 2500 having non-zero node label values may be connected to portions of BELTs which are based, at least in part, on the non-zero label values. Here, the non-zero node label values may be associated with the portions of BELTs according to an association of BELTs and numerals according to a particular association embodiment. In this particular embodiment, for the purpose of illustration, FIG. 23 shows portions of BELTs in BELT 2600 corresponding with a non-zero node label value in node labeled tree 2500. FIG. 23 also shows non-zero node label values in node label tree 2500 above corresponding to portions of BELTs in BELT 2600. Here, the edge between the prior nodes and the new nodes is labeled with a zero value. For nodes with a value k that is a power of two, including the value one, the node value is deleted and (log₂(k)+1) new nodes are attached, labeling the edge between the new nodes and the old nodes with a zero value.

The remaining node label values comprise non-powers of two that are 3 or larger. These node label values may be factored into one or more non-composite numerals according to a particular association embodiment. For such a resulting non-composite numeral factor of a node's label, a tag representing the non-composite numeral factor may be connected to the node by an edge having an edge label value of binary zero. The tag may comprise a portion of a BELT representing the non-composite numeral factor according to an association of BELTs and numerals of a particular association embodiment.

As described below in greater detail, the association of portions of BELTs and numerals may associate unique portions of BELTs and corresponding numerals. In other words, in a particular association embodiment, for any numerical node label value there is a unique corresponding BELT portion. Accordingly, the resulting BELT 2600 may express essentially the same hierarchical data as the node labeled tree 2500 and comprise an elementary equivalent of the node labeled tree 2500. However, it should be understood that this is merely an example of how a node labeled tree may be transformed to an elementary equivalent BELT and the claimed subject matter is not limited in these respects. Since the node labeled tree 2500 comprises an elementary equivalent of the unlabeled tree 2300, BELT 2600 may also comprise an elementary equivalent of unlabeled tree 2300. However, again, this is merely an example of a transformation of an unlabeled tree to an elementary equivalent BELT and the claimed subject matter is not limited in these respects.

FIG. 24 is a flow diagram illustrating a process 2700 of associating node label values with BELTs and/or portions of BELTs according to an embodiment of the transformation illustrated above with reference to FIGS. 21 through 23. Here, process 2700 may be used to associate node label values of nodes in node labeled tree 2500 with corresponding portions of BELTs in BELT 2600, according to the particular association embodiment illustrated in FIG. 23. FIG. 25 is a table showing a particular association embodiment that may be determined according to process 2700. However, it should be understood that process 2700 and FIG. 24 merely illustrate particular association embodiments and that the claimed subject matter is not limited in these respects.

Process 2700 may determine BELT portions corresponding to node labels “k” of a node label tree, as illustrated in the transformation from node labeled tree 2500 to BELT 2600 illustrated above. If a particular node label value k is equal to zero, as determined at diamond 2704, process 2700 merely removes any node label value from a corresponding node in the resulting BELT. For a particular node label value k equal to one, as determined at diamond 2706, block 2708 may attach to a corresponding node in the resulting BELT a single node by an edge having a label value of binary zero. Such a BELT portion corresponding to numeral “1” is shown in the association embodiment of FIG. 25.

For a particular node label value k equal to a power of two, as determined at diamond 2712, block 2710 may attach to a corresponding node in the resulting BELT, log₂(k)+1 nodes by corresponding edges having a label value of binary zero. This is illustrated in the particular association embodiment shown in FIG. 25 with reference to BELT portions corresponding to numerals two, four and eight. Here, two nodes are attached to the corresponding node in the resulting BELT by corresponding edges for a node label value k=2. Three nodes are attached to the corresponding node in the resulting BELT by corresponding edges for a node label value k=4; and four nodes are attached to the corresponding node in the resulting BELT by corresponding edges for a node label value k=8.

According to an embodiment, a node label value k may comprise a natural numeral that is a product of natural numerals x and y greater than one. Under this condition, k comprises a “composite numeral” capable of being factored into natural numerals x and y. Here, the BELT portion representing k in a resulting BELT may be represented as a merger of respective BELT portions represented by the natural numerals x and y at a corresponding node in the resulting BELT providing, in effect, a root node for the merged BELT portions. Alternatively, a node label value k may comprise a “non-composite” natural numeral that cannot be factored into positive natural numerals other than one and itself.

Returning to process 2700, if a node label value k comprises a non-composite natural numeral greater than three, as determined at diamond 2716, block 2714 may attach a BELT portion associated with the non-composite numeral to a corresponding node in the resulting BELT. Here, the BELT portion may be determined from a particular association of BELTs with non-composite numerals.

Returning again to process 2700, if a node label value k comprises a composite natural numeral, as determined at diamond 2716, block 2718 may first factor k by the largest power of two, “w”. This factor may be represented by a BELT portion comprising log₂(w) nodes attached to the corresponding node in the resulting BELT by corresponding edges with label values “0.” The remainder may then be factored into non-composite numerals greater than two. According to a particular association embodiment, as illustrated with reference to block 2714, for example, block 2718 may determine BELT portions corresponding to these non-composite factors of the remainder. Here, for such a resulting non-composite numeral factor of a node's node label, a tag representing the non-composite numeral factor may be connected to the node by an edge having an edge label value of binary zero. The tag may comprise a portion of a BELT representing the non-composite numeral factor according to an association of BELTs and numerals of a particular association embodiment. Such an association of BELTs and numerals according to one particular embodiment is illustrated in detail below.

According to a particular association embodiment, a composite numeral may be represented by individual BELTs and/or BELT portions corresponding with individual factors making up the composite numeral. Here, a “merger” operation may join the BELTs and/or BELT portions corresponding with the individual factors at a common root node to form the BELT and/or BELT portions corresponding with the composite numeral. Accordingly, such a merger operation of BELTs at a root node may correspond with multiplication of numerals corresponding with the merged BELTs. Without belaboring the discussion, such a merger operation is further illustrated in the aforementioned U.S. patent application Ser. No. 11/005,859, filed on Dec. 6, 2004, by J. J. LeTourneau, titled, “Manipulating Sets of Hierarchical Data.”

Returning to process 2700, block 2720 may merge the BELT portions corresponding to these non-composite factors determined at block 2718, and any BELT portion corresponding to a power of two factor “w” of k, at the corresponding node in the resulting BELT. As illustrated in FIG. 26, by way of example, a node value of 1950 may be factored at block 2718 into non-composite numerals as follows: 1950=2×3×5×5×13 As may be observed from FIG. 26, according to the particular association embodiment illustrated in FIG. 25, the BELT portion corresponding to numeral 1950 comprises a merger of BELT portions corresponding to the individual non-composite factors 3, 5, 5 and 13. For the remaining factor “2,” an additional node is connected by an edge having a label value of binary zero. Accordingly, it should be recognized for this particular embodiment that while block 2710 may attach log₂(k)+1 nodes in the resulting BELT for a node label value power of two k, block 2720 may merge log₂(w) nodes for a power of two factor w of a composite node label value (with BELT portions representing non-composite factors greater than two).

Process 2700 should be understood to be merely illustrative of a particular process for generating BELT portions corresponding to node label values in a corresponding node labeled tree. In alternative embodiments, possible node label values may be associated in a look up table with corresponding BELT portions determined, at least in part, according to a particular association embodiment.

Regarding particular association embodiments, FIG. 25 shows that the number of nodes representing non-composite numerals may grow roughly logarithmically with respect to the corresponding non-composite numerals. Nevertheless, it should be understood that the association of non-composite numerals and BELTs as illustrated in FIG. 25 is merely an example of how non-composite numerals may be associated with BELTs in a particular embodiment, and that many other association embodiments may be used without departing from the claimed subject matter. This particular association embodiment, however, makes use of an association of BELTs and natural numerals. FIG. 27 is a table illustrating a particular embodiment of an association between natural numerals BELTs. Here, the resulting BELTs may be used as tags corresponding to non-composite node label values of nodes in a node labeled tree and/or factors thereof. As illustrated in particular embodiments above, these tags are attached to corresponding nodes in the resulting BELT by edges having a label value of binary zero (in which a tag is connected by an edge having a label value of binary zero). It should be recognized that BELTs corresponding to numerals zero and one are used to represent tags corresponding to node label values zero and one as illustrated in FIG. 25. As illustrated in FIG. 27, the tags associated with non-composite node label values and/or factors three, five, seven, eleven and thirteen correspond with the BELTs associated with numerals two, three, four, five and six, respectively. This matches the association of non-composite numerals greater than two and BELT portions shown in FIG. 25

Such an association of BELTs and numerals as illustrated may be generated by an enumeration of BELTs and associating natural numerals to such enumerated BELTs. Thus, for this particular embodiment, although the claimed subject matter is not limited in scope in this respect, a method of enumerating a set of trees begins with enumeration of an empty binary edge labeled tree and a one node binary edge labeled tree. Here, the empty tree is associated with the zero and has a symbolic representation as illustrated in FIG. 27 (circle). Likewise, the one node tree, which holds no data, is associated with the one and has a graphical representation of a single node. For higher positive natural numerals, however, this embodiment of a method of enumerating a set of trees comprises positioning a tree at location k, k being a positive numeral greater than three, in which k comprises the product of u and v, u and v comprising positive numerals greater than one, such that the tree is formed by a union of the trees at positions u and v. Likewise, for those locations that are not a product of other natural positive numerals greater than one, that is, for locations that comprise non-composite numerals, denoted here by j, for example, j being a positive natural numeral greater than one, a tree is positioned at location j such that the tree is formed by finding the first tree in the prior enumeration such that the binary edge labeled tree obtainable from this first tree by attaching a node to the particular tree as a new root node and labeling the edge between the new root node and the prior root node with a binary zero label is not in the enumeration at some position lower than j; however, if the binary edge labeled tree obtainable from that first tree, as just described, is present in the enumeration with a binary zero label for the new edge, but not with a binary “1” label, then the tree at position j is that tree with a binary “1” label for the new edge. This may be illustrated, for example in FIG. 27, as described in more detail below.

For a particular embodiment, although the claimed subject matter is not limited in scope in this respect, a method of enumerating a set of ordered trees may begin with enumeration of an empty binary edge labeled tree and a one node binary edge labeled tree. Thus, the empty tree is associated with the zero and has a symbolic representation as illustrated in FIG. 27 (circle). Likewise, the one node tree, which holds no data, is associated with the one and has a graphical representation of a single node. For higher positive natural numerals, ordered trees may be generated by a process described, for example, in “The Lexicographic Generation of Ordered Trees,” by S. Zaks, The Journal of Theoretical Computer Science, Vol. 10(1), pp. 63-82, 1980, or Enumerating Ordered Trees Lexicographically,” by M. C. Er, Computation Journal, Vol. 28, Issue 5, pp. 538-542, 1985.

As illustrated, for this particular embodiment, and as previously described, the empty tree has zero nodes and is associated with the zero. Likewise, the one node tree root comprises a single node and is associated with the one. Thus, to obtain the tree at position two, a root node is attached and connected to the prior root node by an edge. Likewise, here, by convention, the edge is labeled with a binary zero. If, however, the tree formed by the immediately proceeding approach were present in the prior enumeration of trees, then a similar process embodiment is followed, but, instead, the new edge is labeled with a binary one rather than a binary zero. Thus, for example, in order to obtain the binary edge labeled tree for position three, a new root node is connected to the root node by an edge and that edge is labeled with a binary one.

Continuing with this example, to obtain the binary edge labeled tree for position four, observe that numeral four is the product of numeral two times numeral two. Thus, a union is formed at the root of two trees, where, here, each of those trees is associated with the positive natural numeral two. Likewise, to obtain the binary edge labeled tree for position five, begin with the binary edge labeled tree for position two and follow the previously articulated approach of adding a root and an edge and labeling it with a binary zero.

In this context, adding a root node and an edge and labeling it binary zero is referred to as a “zero-push” operation and adding a root node and an edge and labeling it binary one is referred to as a “one-push” operation. Based at least in part on the prior description, for this particular embodiment, it may now be demonstrated that if k is any positive natural numeral and a tree is positioned at location k, then a non-composite numeral is associated with the zero-push of that tree and a non-composite numeral is associated with the one-push for that tree. Furthermore, the non-composite index of the zero-push of the tree comprises 2k−1, whereas the non-composite index of the one-push of the tree comprises 2k, where the index corresponds to the argument of the well-known Kleene enumeration on positive natural numerals of non-composite numerals, as illustrated, for example, in part in FIG. 28. Thus, referring again to FIG. 27, the one-push of the root tree is the tree at position three. This follows from FIG. 27 since P(2*1)=P(2)=3. Likewise, the tree at position five is the zero-push of the tree at position 2. Again, this follows from FIG. 28 since P(2*2−1)=P(3)=5.

The embodiments illustrate in FIGS. 5 through 23 involve connecting tags (BELT portions representing node label values and/or factors thereof) to unlabeled nodes by edges having a label value of binary zero and assign an edge label value of binary one to the remaining edges in the resulting BELT. In alternative embodiments, however, such edges connecting tags may have a label value of binary one with the remaining edges having a label value of binary zero, although the claimed subject matter is not limited in these respects.

Also, the transformations illustrated above with reference to FIGS. 5 through 23 are particularly directed to transforming an unlabeled tree and/or a node labeled tree to a BELT. However, it should be recognized that, as a BLT may essentially be represented as either a BELT or a BNLT, such techniques illustrated herein would equally apply to the representation of hierarchical data of an unlabeled tree and/or node labeled tree in a BNLT.

Techniques for performing table look ups are well-known and well-understood. Thus, this will not be discussed in detail here. However, it shall be appreciated that any and all of the previously described and/or later described processing, operations, conversions, transformations, manipulations, etc. of strings, trees, numerals, data, etc. may be performed on one or more computing platforms or similar computing devices, such as those that may include a memory to store tables although, the claimed subject matter is not necessarily limited in scope to this particular approach. Thus, for example, a hierarchy of data may be formed by combining two or more hierarchies of data, such as by applying a previously described embodiment. Likewise, multiple hierarchies of data may be formed by splitting or dividing a particular hierarchy of data, again, such as by applying a previously described embodiment. Likewise, additional operations and/or manipulations of data hierarchies may be performed, such as ordering hierarchies of data and more. It is intended that the claimed subject matter cover all such embodiments.

It will, of course, be understood that, although particular embodiments have just been described, the claimed subject matter is not limited in scope to a particular embodiment or implementation. For example, one embodiment may be in hardware, such as implemented to operate on a device or combination of devices, for example, whereas another embodiment may be in software. Likewise, an embodiment may be implemented in firmware, or as any combination of hardware, software, and/or firmware, for example. Likewise, although the claimed subject matter is not limited in scope in this respect, one embodiment may comprise one or more articles, such as a storage medium or storage media. This storage media, such as, one or more CD-ROMs and/or disks, for example, may have stored thereon instructions, that when executed by a system, such as a computer system, computing platform, or other system, for example, may result in an embodiment of a method in accordance with the claimed subject matter being executed, such as one of the embodiments previously described, for example. As one potential example, a computing platform may include one or more processing units or processors, one or more input/output devices, such as a display, a keyboard and/or a mouse, and/or one or more memories, such as static random access memory, dynamic random access memory, flash memory, and/or a hard drive, although, again, the claimed subject matter is not limited in scope to this example.

In the preceding description, various aspects of the claimed subject matter have been described. For purposes of explanation, specific numbers, systems and/or configurations were set forth to provide a thorough understanding of the claimed subject matter. However, it should be apparent to one skilled in the art having the benefit of this disclosure that the claimed subject matter may be practiced without the specific details. In other instances, well-known features were omitted and/or simplified so as not to obscure the claimed subject matter. While certain features have been illustrated and/or described herein, many modifications, substitutions, changes and/or equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and/or changes as fall within the true spirit of the claimed subject matter. 

What is claimed is:
 1. A method of converting a complex two dimensional graphical hierarchy of signal values for more convenient processing and/or storage, said complex two dimensional graphical hierarchy being in the form of a tree hierarchy, said method comprising: accessing instructions from one or more physical memory devices for execution by one or more processors; executing said instructions accessed from said one or more physical memory devices by said one or more processors; storing, in at least one of said physical memory devices, signals values resulting from having executed said instructions on said one or more processors; said accessed instructions to transform complex two dimensional graphical hierarchies; and wherein executing said transformation instructions further comprising: accessing, from said one or more physical memory devices, signal values representing an unlabeled complex two dimensional graphical hierarchy; transforming said signal values representing said unlabeled complex two dimensional graphical hierarchy to signal values representing a labeled complex two dimensional graphical hierarchy, said unlabeled complex two dimensional graphical hierarchy and said labeled complex two dimensional graphical hierarchy being elementary equivalents; and storing said signal values representing said labeled complex two dimensional graphical hierarchy.
 2. The method of claim 1, wherein said transforming said signal values representing said unlabeled tree hierarchy to said signal values representing said labeled tree hierarchy further comprises: transforming said signal values representing said unlabeled tree hierarchy to signal values representing a node labeled tree hierarchy, said unlabeled tree hierarchy and said node labeled tree hierarchy being elementary equivalents.
 3. The method of claim 2, wherein said transforming said signal values representing said unlabeled tree hierarchy to said signal values representing said node labeled tree hierarchy further comprises: selecting signal values representing frontier nodes of said unlabeled tree hierarchy; pruning one or more signal values representing terminal node children from said signal values representing said frontier nodes; and storing signal values representing remaining unpruned terminal nodes of said unlabeled tree hierarchy as node labels of nodes corresponding with parent nodes of said remaining unpruned terminal nodes.
 4. The method of claim 3, wherein nodes in said node labeled tree hierarchy are associated with signal values representing node label values, and wherein said transforming said signal values representing said node labeled tree hierarchy to signal values representing a labeled tree hierarchy comprises representing said signal values representing node label values of selected ones of said nodes in said node labeled tree hierarchy as one or more nodes coupled to nodes in said labeled tree hierarchy corresponding with said selected nodes.
 5. The method of claim 4, wherein said signal values representing said node label values are associated with numeral values, and wherein said signal values representing node label values of selected ones of said nodes in said node labeled tree hierarchy further comprises: associating said signal values representing said node label values of said selected nodes in said node labeled tree hierarchy with corresponding tree hierarchies and/or labeled tree hierarchy portions according to an association of tree hierarchies and signal values representing said numeral values; and representing said signal values representing said node label values with said corresponding tree hierarchies and/or hierarchy portions.
 6. The method of claim 2, wherein said transforming said signal values representing said unlabeled tree hierarchy to said signal values representing said labeled tree hierarchy further comprises: transforming said signal values representing said node labeled tree hierarchy to signal values representing a binary labeled tree hierarchy, said node labeled tree hierarchy and said binary labeled tree hierarchy being elementary equivalents.
 7. The method of claim 1, wherein said labeled tree hierarchy comprises a binary edge labeled tree hierarchy.
 8. The method of claim 1, wherein said transforming said signal values representing said unlabeled tree hierarchy to said signal values representing said labeled tree hierarchy further comprises displaying said labeled tree hierarchy.
 9. A method of converting a complex two dimensional graphical hierarchy of signal values for more convenient processing and/or storage, said complex two dimensional graphical hierarch being in the form of a tree hierarchy, said method comprising: accessing instructions from one or more physical memory devices for execution by one or more processors; executing said instructions accessed from said one or more physical memory devices by said one or more processors; storing, in at least one of said physical memory devices, signals values resulting from having executed said instructions on said one or more processors; wherein said accessed instructions to transform complex two dimensional graphical hierarchies; and wherein executing said transformation instructions further comprising: accessing, from said one or more physical memory devices, signal values representing a node labeled complex two dimensional graphical hierarchy; transforming said signal values representing said node labeled complex two dimensional graphical hierarchy to signal values representing an edge labeled complex two dimensional graphical hierarchy, said node labeled complex two dimensional graphical hierarchy and said edge labeled complex two dimensional graphical hierarchy being elementary equivalents; and storing said signal values representing said edge labeled complex two dimensional graphical hierarchy.
 10. The method of claim 9, wherein nodes in said node labeled tree hierarchy are associated with signal values representing said node label values, and further comprising representing said signal values representing said node label values of selected ones of said nodes in said node labeled tree hierarchy as one or more nodes coupled to nodes in said edge labeled tree hierarchy corresponding with said selected nodes.
 11. The method of claim 10, wherein said signal values representing said node label values are associated with numeral values, and wherein said signal values representing said node label values of selected ones of said nodes in said node labeled tree hierarchy further comprises: associating said signal values representing said node label values of said selected nodes in said node labeled tree hierarchy with corresponding edge labeled tree hierarchies and/or edge labeled tree hierarchy portions according to an association of tree hierarchies and signal values representing said numeral values; and representing said signal values representing said node label values of said selected nodes in said edge labeled tree hierarchy by extending said corresponding edge labeled tree hierarchies and/or edge labeled tree hierarchy portions from nodes in said edge labeled tree hierarchy associated with said selected nodes in said node labeled tree hierarchy.
 12. The method of claim 9, wherein said executing said transformation instructions further comprising displaying said edge labeled tree hierarchy.
 13. A method of converting a complex two dimensional graphical hierarchy of signal values for more convenient processing and/or storage, said complex two dimensional graphical hierarchy being in the form of a tree hierarchy, said method comprising: accessing instructions from one or more physical memory devices for execution by one or more processors; executing said instructions accessed from said one or more physical memory devices by said one or more processors; storing, in at least one of said physical memory devices, signals values resulting from having executed said instructions on said one or more processors; wherein said accessed instructions to transform complex two dimensional graphical hierarchies; and wherein executing said transformation instructions further comprising: accessing, from said one or more physical memory devices, signal values representing an unlabeled complex two dimensional graphical hierarchy; transforming said signal values representing said unlabeled complex two dimensional graphical hierarchy to signal values representing an edge labeled complex two dimensional graphical hierarchy, said unlabeled complex two dimensional graphical hierarchy and said edge labeled complex two dimensional graphical hierarchy being elementary equivalents; and storing said signal values representing said edge labeled complex two dimensional graphical hierarchy.
 14. The method of claim 13, wherein said executing said transformation instructions further comprising: selecting signal values representing frontier nodes of said unlabeled tree hierarchy; pruning one or more signal values representing terminal node children from said signal values representing said frontier nodes; and storing signal values representing remaining unpruned terminal nodes of said unlabeled tree hierarchy as node labels of nodes corresponding with parent nodes of said remaining unpruned terminal nodes in said unlabeled tree hierarchy.
 15. The method of claim 13, wherein said transforming said signal values representing said unlabeled tree hierarchy to said signal values representing said edge labeled tree hierarchy further comprises displaying said edge labeled tree hierarchy.
 16. An apparatus, comprising: one or more processors coupled to one or more physical memory devices to store executable instructions and to store binary digital storage quantities as physical memory states, wherein said executable instructions being accessible from said one or more physical memory devices for execution by said one or more processors; executable by said one or more processors; and able to store in at least one of said physical memory devices, binary digital signal quantities, if any, that are to result from execution of said instructions on said one or more processors, wherein said accessed executable instructions to transform said complex two dimensional graphical hierarchy; and wherein said transformation instructions further to: access, from said one or more physical memory devices, signal values to represent an unlabeled complex two dimensional graphical hierarchy; transform said signal values to represent said unlabeled complex two dimensional graphical hierarchy to signal values to represent a labeled complex two dimensional graphical hierarchy, said unlabeled complex two dimensional graphical hierarchy and said labeled complex two dimensional graphical hierarchy to be elementary equivalents; and store said signal values to represent said labeled complex two dimensional graphical hierarchy.
 17. The apparatus of claim 16, wherein said transformation instructions being further executable by said one or more processors to: transform said signal values to represent said unlabeled tree hierarchy to signal values to represent a node labeled tree hierarchy, said unlabeled tree hierarchy and said node labeled tree hierarchy to be elementary equivalents.
 18. An apparatus, comprising: one or more processors coupled to one or more physical memory devices to store executable instructions and to store binary digital storage quantities as physical memory states, wherein said executable instructions being accessible from said one or more physical memory devices for execution by said one or more processors; executable by said one or more processors; and able to store in at least one of said physical memory devices, binary digital signal quantities, if any, that are to result from execution of said executable instructions on said one or more processors, wherein said accessed executable instructions to transform complex two dimensional graphical hierarchies; and wherein said transformation instructions further to: access, from said one or more physical memory devices, signal values to represent a node labeled complex two dimensional graphical hierarchy; and transform said signal values to represent said node labeled complex two dimensional graphical hierarchy to signal values to represent an edge labeled complex two dimensional graphical hierarchy, said node labeled complex two dimensional graphical hierarchy and said edge labeled complex two dimensional graphical hierarchy to be elementary equivalents; and store said signal values to represent said edge labeled complex two dimensional graphical hierarchy.
 19. The apparatus of claim 18, wherein nodes in said node labeled tree hierarchy are associated with signal values to represent node label values, and wherein said transformation instructions being further executable by said one or more processors: represent signal values to represent said node label values of selected ones of said nodes in said node labeled tree hierarchy as one or more nodes to be coupled to nodes in said edge labeled tree hierarchy corresponding with said selected nodes.
 20. An apparatus, comprising: one or more processors coupled to one or more physical memory devices to store executable instructions and to store binary digital storage quantities as physical memory states, wherein said executable instructions being accessible from said one or more physical memory devices for execution by said one or more processors; executable by said one or more processors; and able to store in at least one of said physical memory devices, binary digital signal quantities, if any, that are to result from execution of said executable instructions on said one or more processors, wherein said accessed executable instructions to transform a complex two dimensional graphical hierarchy; and wherein said transformation instructions further to: access, from said one or more physical memory devices, signal values to represent an unlabeled complex two dimensional graphical hierarchy; transform said signal values to represent said unlabeled complex two dimensional graphical hierarchy to signal values to represent an edge labeled complex two dimensional graphical hierarchy, said unlabeled complex two dimensional graphical hierarchy and said edge labeled complex two dimensional graphical hierarchy to be elementary equivalents; and store said signal values to represent said edge labeled complex two dimensional graphical hierarchy.
 21. The apparatus of claim 20, wherein said transformation instructions being further executable by said one or more processors to: select signal values to represent further nodes of said unlabeled tree hierarchy; prune one or more signal values to represent terminal node children from said signal values to represent said frontier nodes; and store signal values to represent remaining unpruned terminal nodes of said unlabeled tree hierarchy as node labels of nodes corresponding with parent nodes of remaining unpruned terminal nodes in said unlabeled tree hierarchy. 